NUMA-aware reader-writer locks

Scalable Reader-Writer Locks for Parallel Systems

NUMA aware locks Implementation and Evaluation

Programs running on NUMA machines are sensitive to memory access locality[3]. Acessing data on the local memory is significantly faster than remote memory. Thus, designing locks that can take advantage of this property would improve the performance. We review three papers related to this topic and study the behaviors of these NUMA aware locks. We implement these locks in C++, and evaluate them ...

Scalable Read-mostly Synchronization Using Passive Reader-Writer Locks

Reader-writer locks (rwlocks) aim to maximize parallelism among readers, but many existing rwlocks either cause readers to contend, or significantly extend writer latency, or both. Further, some scalable rwlocks cannot cope with OS semantics like sleeping inside critical sections, preemption and conditional wait. Though truly scalable rwlocks exist, some of them cannot handle preemption, sleepi...

Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks

When a process attempts to acquire a mutex lock, it may be forced to wait if another process currently holds the lock. In certain applications, such as real-time operating systems and databases, indefinite waiting can cause a process to miss an important deadline [20]. Hence, there has been research on designing abortable mutual exclusion locks, and fairly efficient algorithms of O(log n) RMR c...

Constant RMR Transformation to Augment Reader-Writer Locks with Atomic Upgrade/Downgrade Support

The reader-writer problem [1] seeks to provide a lock that protects some critical section of code for two classes of processes: readers and writers. Multiple readers can have access to the critical section simultaneously, but only one writer can have access to the critical section to the exclusion of all other processes. The difficulties in solving the reader-writer problem lie not only in deve...